Sachs’ free data in real connection variables
نویسندگان
چکیده
منابع مشابه
Reliable Real-time Data Transmission in Manet Using Connection Possibility
In Mobile Ad hoc Networks (MANET), reliability in real time data transmission can be assured by confirming the connectivity of the network. Since, MANETs are characterized by dynamic topology changes; the established connection must be monitored for its consistency. In order to provide and maintain connectivity, in this paper, we propose a reliable real time data transmission technique in MANET...
متن کاملHazard-Free Connection Release
Fault-tolerant communication in a distributed system requires reliable connection management and message delivery. Reliable connection management includes the guarantee of hazard-free release, in which no data is lost before the connection is terminated. Our work focuses on protocols in which the end nodes retain no connection-speci c information between incarnations, operating over networks th...
متن کاملConnection { Free Differential
Both vector 1-forms (tensor elds of type (1,1)) and Lie brackets map (tangent) vectors to the same. The former do so in a manner that is linear over the ring of functions; the latter are bilinear, but only over the constants. By composing one Lie bracket and m vector 1-forms (we consider 2 m 4) in all possible ways many maps of vector elds are obtained, bilinear over the constants. We study lin...
متن کاملSome inequalities in connection to relative orders of entire functions of several complex variables
Let f, g and h be all entire functions of several complex variables. In this paper we would like to establish some inequalities on the basis of relative order and relative lower order of f with respect to g when the relative orders and relative lower orders of both f and g with respect to h are given.
متن کاملConflict-free connection of trees
An edge-colored graph G is conflict-free connected if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are required in order to make G conflict-free connected. A coloring of vertices of a hypergraph H = (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2017
ISSN: 1029-8479
DOI: 10.1007/jhep11(2017)205